Regularity in weighted oriented graphs
نویسندگان
چکیده
Let D be a weighted oriented graph with the underlying G and I(D), I(G) edge ideals corresponding to respectively. We show that regularity of ideal certain class remains same even after adding kind new edges it. also establish relationship between path cycle their when vertices $$V^+$$ are sinks.
منابع مشابه
Antimagic Labelings of Weighted and Oriented Graphs∗
A graph G is k–weighted–list–antimagic if for any vertex weighting ω : V (G) → R and any list assignment L : E(G)→ 2R with |L(e)| ≥ |E(G)|+k there exists an edge labeling f such that f(e) ∈ L(e) for all e ∈ E(G), labels of edges are pairwise distinct, and the sum of the labels on edges incident to a vertex plus the weight of that vertex is distinct from the sum at every other vertex. In this pa...
متن کاملNew skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
متن کاملWeighted analytic regularity in polyhedra
We explain a simple strategy to establish analytic regularity for solutions of second order linear elliptic boundary value problems. The abstract framework presented here helps to understand the proof of analytic regularity in polyhedral domains given in the authors’ paper in Math. Models Methods Appl. Sci. 22 (8) (2012). We illustrate this strategy by considering problems set in smooth domains...
متن کاملRegularity Lemmas for Graphs
Szemerédi’s regularity lemma proved to be a fundamental result in modern graph theory. It had a number of important applications and is a widely used tool in extremal combinatorics. For some applications variants of the regularity lemma were considered. Here we discuss several of those variants and their relation to each other.
متن کاملRegularity of Congruential Graphs
The aim of this article is to make a link between the congruential systems investigated by Conway and the theory of innnite graphs. We compare the graphs of congruential systems with a well known family of innnite graphs: the regular graphs of nite degree. Those graphs, rst considered by Muller and Schupp then by Courcelle, are the transition graph of pushdown automa-ta and have a decidable mon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Pure and Applied Mathematics
سال: 2021
ISSN: ['0019-5588', '0975-7465', '2455-0000']
DOI: https://doi.org/10.1007/s13226-021-00039-2